On quantum symmetries of ADE graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Quantum Symmetries of the Non–ade Graph F 4

We describe quantum symmetries associated with the F 4 Dynkin diagram. Our study stems from an analysis of the (Ocneanu) modular splitting equation applied to a partition function which is invariant under a particular congruence subgroup of the modular group.

متن کامل

on the symmetries of some classes of recursive circulant graphs

a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...

متن کامل

Sequences on Graphs with Symmetries

An interesting symmetry on multiplication of numbers found by Prof.Smarandache recently. By considering integers or elements in groups on graphs, we extend this symmetry on graphs and find geometrical symmetries. For extending further, Smarandache’s or combinatorial systems are also discussed in this paper, particularly, the CC conjecture presented by myself six years ago, which enables one to ...

متن کامل

Almost-symmetries of Graphs

Many successful uses of symmetries in discrete computational problems rely on group-theoretical properties. Almost-symmetries can be more numerous, but do not have the same properties. In this work, we study almost-symmetries of graphs, proposing data structures for representing them, algorithms for finding them, and logic predicates for symmetry-breaking.

متن کامل

Decomposing Graphs with Symmetries

While decomposing graphs in simpler items greatly helps to design more efficient algorithms, some classes of graphs can not be handled using the classical techniques. We show here that a graph having enough symmetries can be factored into simpler blocks through a standard morphism and that the inverse process may be formalized as a pullback rewriting system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Theoretical and Mathematical Physics

سال: 2004

ISSN: 1095-0761,1095-0753

DOI: 10.4310/atmp.2004.v8.n1.a5